A class of continuous convex programming problems
نویسندگان
چکیده
منابع مشابه
A generalized implicit enumeration algorithm for a class of integer nonlinear programming problems
Presented here is a generalization of the implicit enumeration algorithm that can be applied when the objec-tive function is being maximized and can be rewritten as the difference of two non-decreasing functions. Also developed is a computational algorithm, named linear speedup, to use whatever explicit linear constraints are present to speedup the search for a solution. The method is easy to u...
متن کاملA Repository of Convex Quadratic Programming Problems∗
The introduction of a standard set of linear programming problems, to be found in NETLIB/LP/DATA, had an important impact on measuring, comparing and reporting the performance of LP solvers. Until recently the efficiency of new algorithmic developments has been measured using this important reference set. Presently, we are witnessing an ever growing interest in the area of quadratic programming...
متن کاملA Recurrent Neural Network for Solving Strictly Convex Quadratic Programming Problems
In this paper we present an improved neural network to solve strictly convex quadratic programming(QP) problem. The proposed model is derived based on a piecewise equation correspond to optimality condition of convex (QP) problem and has a lower structure complexity respect to the other existing neural network model for solving such problems. In theoretical aspect, stability and global converge...
متن کاملA Nonlinear Analytic Center Cutting Plane Method for a Class of Convex Programming Problems
A cutting plane algorithm for minimizing a convex function subject to constraints deened by a separation oracle is presented. The algorithm is based on approximate analytic centers. The nonlinearity of the objective function is taken into account, yet the feasible region is approximated by a containing polytope. This containing polytope is regularly updated by adding a new cut through a test po...
متن کاملA Nonlinear Analytic Center Cutting Plane Method for a Class of Convex Programming Problems
A cutting plane algorithm for minimizing a convex function subject to constraints de ned by a separation oracle is presented. The algorithm is based on approximate analytic centers. The nonlinearity of the objective function is taken into account, yet the feasible region is approximated by a containing polytope. This containing polytope is regularly updated either by adding a new cut at or by s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1968
ISSN: 0022-247X
DOI: 10.1016/0022-247x(68)90184-4